0 Search for Three forged Coins
نویسنده
چکیده
We give a simple and efficient sequential weighing algorithm to search for three forged coins, with an asymptotic rate of 0.57, which is better than that (0.46) of the known static algorithm given by Lindström. Then we construct from the weighing algorithm an zero-error code for the three-user Multiple Access Adder Channel with feedback with rate 0.57.
منابع مشابه
Search for Three forged Coins
We give a simple and efficient sequential weighing algorithm to search for three forged coins, with an asymptotic rate of 0.57, which is better than that (0.46) of the known static algorithm given by Lindström. Then we construct from the weighing algorithm an zero-error code for the three-user Multiple Access Adder Channel with feedback with rate 0.57.
متن کاملOn the Detection of Mixture Distributions with applications to the Most Biased Coin Problem
This paper studies the trade-off between two different kinds of pure exploration: breadth versus depth. The most biased coin problem asks how many total coin flips are required to identify a “heavy” coin from an infinite bag containing both “heavy” coins with mean θ1 ∈ (0, 1), and “light” coins with mean θ0 ∈ (0, θ1), where heavy coins are drawn from the bag with probability α ∈ (0, 1/2). The k...
متن کاملThe Power of Adaptivity in Identifying Statistical Alternatives
This paper studies the trade-off between two different kinds of pure exploration: breadth versus depth. We focus on the most biased coin problem, asking how many total coin flips are required to identify a “heavy” coin from an infinite bag containing both “heavy” coins with mean ✓ 1 2 (0, 1), and “light" coins with mean ✓ 0 2 (0, ✓ 1 ), where heavy coins are drawn from the bag with proportion ↵...
متن کاملFinding Weighted Graphs by Combinatorial Search
We consider the problem of finding edges of a hidden weighted graph using a certain type of queries. Let G be a weighted graph with n vertices. In the most general setting, the n vertices are known and no other information about G is given. The problem is finding all edges of G and their weights using additive queries, where, for an additive query, one chooses a set of vertices and asks the sum...
متن کاملSearch problems for two irregular coins with incomplete feedback: the underweight model
Problems of detecting two (or one of two) irregular coins x and y among a set of n coins are considered. The testing device is such that it returns feedback 1 if x belongs to the test set and y does not, while it returns feedback 0 otherwise. We present a lower bound on the worst-case number of tests necessary to nd one of the two irregular coins as well as on the worst-case number of tests to ...
متن کامل